Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
221	UNIVERSIDAD DE BUENOS AIRES Facultad de Ciencias Exactas y Naturales Departamento de Computación REPRESENTACIONES MINIMALES DE GRAFOS DE INTERVALOS UNITARIOS Add to Reading List Source URL: dc.uba.ar Language: English - Date: 2014-09-09 10:40:00 Comparability graph Algorithm Time complexity Trapezoid graph Graph theory Theoretical computer science Interval graph
222	Linear Time Nonparametric Classification and Feature Selection with Polynomial MPMC Cascades for large datasets Markus Breitenbach1 , Sander M. Bohte1,2 , and Gregory Z. Grudic1 1 Add to Reading List Source URL: markus-breitenbach.com Language: English - Date: 2004-06-24 11:16:08 Applied mathematics Linear classifier Ensemble learning Time complexity Support vector machine Algorithm Computational complexity theory Stability Boosting methods for object categorization Machine learning Statistics Statistical classification
223	Distributed Agreement with Optimal Communication Complexity Seth Gilbert EPFL Abstract We consider the problem of fault-tolerant agreement in Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:45:55 Analysis of algorithms Fault-tolerant computer systems Probabilistic complexity theory Consensus Randomized algorithm Distributed algorithm Factorial IP Time complexity Theoretical computer science Computational complexity theory Mathematics
224	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:08 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
225	The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:06 Computer science Computational complexity theory Algorithm Mathematical logic Randomized algorithm Time complexity Adversary model Distributed computing Quantum algorithm Theoretical computer science Applied mathematics Analysis of algorithms
226	Extended abstract: Dagstuhl Seminar 09381, 13-18 SeptemberRefinement, Problems and Structures Michael Jackson The Open University Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2009-10-08 07:36:24 Time Escapement Pendulum clock Pendulum Complexity Clock Decomposition System Problem frames approach Horology Measurement Science
227	CS 373: Combinatorial Algorithms, Fall 2000 Homework 0, due August 31, 2000 at the beginning of class Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:18 Mathematical notation Integer sequences Combinatorics Number theory Factorial Big O notation Randomized algorithm Fibonacci number Time complexity Mathematics Theoretical computer science Analysis of algorithms
228	The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 03:04:07 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Dominating set Exponential time hypothesis Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
229	Finding a path of length k in O∗(2k ) time arXiv:0807.3026v3 [cs.DS] 9 Nov 2008 Ryan Williams∗ Carnegie Mellon University Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-11-08 20:04:23 Analysis of algorithms Polynomials Probabilistic complexity theory Randomized algorithm Matching Schwartz–Zippel lemma Time complexity NP Color-coding Theoretical computer science Applied mathematics Mathematics
230	On the Complexity of Numerical Analysis Eric Allender Rutgers, the State University of NJ Department of Computer Science Piscataway, NJ, USA Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - Date: 2008-12-08 14:23:03 Complexity classes Polynomial Advice P Reduction Time complexity Bounded-error probabilistic polynomial Circuit complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE